Generalized Matching: a new approach to concurrent logic optimization and library binding

In this work we describe a novel approach to the classical problem of library binding. We de ne the concept of generalized matching, a Boolean constraint whose satisfaction allows us to nd all possible input assignments for which a library element matches a given Boolean relation. Completely and incompletely speci ed Boolean functions are treated as particular cases. Generalized matching supports the simultaneous matching of more than one single-output cell (or the optimal use of multi-output cells) and allows the optimization of pin-assignment dependent cost functions. We describe a fully symbolic procedure for generalized matching, and we discuss the related e ciency issues. The advantages of generalized matching over traditional Boolean matching are then discussed by means of examples.